Multi-Task Learning-Based Task Scheduling Switcher for a Resource-Constrained IoT System
نویسندگان
چکیده
In this journal, we proposed a novel method of using multi-task learning to switch the scheduling algorithm. With change algorithm inside framework, framework can create scheduler with best task execution optimization under computation deadline. changing number tasks, types resources taken, and deadline, it is hard for single achieve while avoiding worst-case time complexity in resource-constrained Internet Things (IoT) system due trade-off each Furthermore, different hardware specifications affect differently, making rely on Big-O as reference. profile behavior used compute scheduler, identify Our benchmark result shows that an average 93.68% accuracy meeting along 23.41% optimization. Based results, our improve IoT system.
منابع مشابه
The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملA Parallel Approach to Resource-Constrained Task Scheduling Problem
The task scheduling problem (TSP or SP) is a well known topic. Basically it consists of a group of task that should be executed (activated, started) somehow, spending the least time possible. The classic problem consider, besides tasks, the precedence and the processing units (PU) in which those tasks will be executed. These units might have similar characteristics (homogeneous environment) or ...
متن کاملA Resource-aware task scheduling
❉❡♣❡♥❞❡♥❝2✲❛✇❛r❡ t❛s❦✲❜❛s❡❞ ♣❛r❛❧❧❡❧ ♣r♦❣r❛♠♠✐♥❣ ♠♦❞❡❧s ❤❛✈❡ ♣r♦✈❡♥ t♦ ❜❡ s✉❝❝❡ss❢✉❧ ❢♦r ❞❡✈❡❧♦♣✐♥❣ ❡✣✲ ❝✐❡♥t ❛♣♣❧✐❝❛t✐♦♥ s♦❢t✇❛r❡ ❢♦r ♠✉❧t✐❝♦r❡✲❜❛s❡❞ ❝♦♠♣✉t❡r ❛r❝❤✐t❡❝t✉r❡s✳ ❚❤❡ ♣r♦❣r❛♠♠✐♥❣ ♠♦❞❡❧ ✐s ❛♠❡♥❛❜❧❡ t♦ ♣r♦❣r❛♠♠❡rs✱ t❤❡r❡❜2 s✉♣♣♦rt✐♥❣ ♣r♦❞✉❝t✐✈✐t2✱ ✇❤✐❧❡ ❤❛r❞✇❛r❡ ♣❡r❢♦r♠❛♥❝❡ ✐s ❛❝❤✐❡✈❡❞ t❤r♦✉❣❤ ❛ r✉♥✲ t✐♠❡ s2st❡♠ t❤❛t ❞2♥❛♠✐❝❛❧❧2 s❝❤❡❞✉❧❡s t❛s❦s ♦♥t♦ ❝♦r❡s ✐♥ s✉❝❤ ❛ ✇❛2 t❤❛t ❛❧❧ ❞❡♣❡♥❞...
متن کاملIterated Multi-Robot Auctions for Precedence-Constrained Task Scheduling
We consider the multi-robot task scheduling problem with precedence constraints, and introduce a general algorithm to approximate a solution to this problem. Our algorithm utilizes an iterated auction scheme, in which a batch of tasks that are pairwise unconstrained is selected in each iteration and scheduled using a modified sequential single-item auction. This algorithm also gains flexibility...
متن کاملTask Scheduling in Grid Computing Systems constrained by Resource Availability
In this paper, a survey of some of the approaches to task scheduling in grid computing systems based on resource availability is discussed. To improve task scheduling, resource availability can be predicted by multistate availability predictors. Execution time of each application is modeled by a random variable. Each application is associated with a set of probability mass function (pmf), one p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information
سال: 2021
ISSN: ['2078-2489']
DOI: https://doi.org/10.3390/info12040150